Route discovery with constant memory in oriented planar geometric networks
نویسندگان
چکیده
منابع مشابه
Route Discovery with Constant Memory in Oriented Planar Geometric Networks
We address the problem of discovering routes in strongly connected planar geometric networks with directed links. We consider two types of directed planar geometric networks: Eulerian (in which every vertex has the same number of ingoing and outgoing edges) and outerplanar (in which a single face contains all the vertices of the network). Motivated by the necessity for establishing communicatio...
متن کاملLight Orthogonal Networks with Constant Geometric Dilation
An orthogonal network for a given set of n points in the plane is an axis-aligned planar straight line graph that connects all input points. We show that for any set of n points in the plane, there is an orthogonal network that (i) is short having a total edge length of O(jT j), where jT j denotes the length of a minimum Euclidean spanning tree for the point set; (ii) is small having O(n) verti...
متن کاملEfficient route discovery in hybrid networks
Hybrid networks are formed by a combination of access points and mobile nodes such that the mobile nodes can communicate both through the access points and using ad-hoc networking among themselves. This work deals with providing efficient routing between mobile devices in hybrid networks. Specifically, we assume the existence of a spanning tree from each access point to all mobile devices withi...
متن کاملConstant memory routing in quasi-planar and quasi-polyhedral graphs
We address the problem of on-line route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In the former case such graphs are geometrically embedded in R2 and have an underlying backbone that is planar with convex faces howeve...
متن کاملThroughput Capacity of Ad Hoc Networks with Route Discovery
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2006
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20114